Solid State Transducers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Finite State Transducers

We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at least for low probability of success). However, like their ‘little brothers’, the quantum finite automata, the power of qfst is incomparable to that ...

متن کامل

Finite-State Transducers

Finite-state transducers play an important role in natural language processing. They provide a model for text and speech, as well as transformations of them. In order to reduce the complexity of their application, deterministic and minimal transducers are required. This essay introduces a particular type of finite-state transducers, subsequential string-to-weight transducers, and presents algor...

متن کامل

State-Identification Problems for Finite-State Transducers

A well-established theory exists for testing finite-state machines, in particular Moore and Mealy machines. A fundamental class of problems handled by this theory is state identification: we are given a machine with known state space and transition relation but unknown initial state, and we are asked to find experiments which permit to identify the initial or final state of the machine, called ...

متن کامل

Multi-solid Varieties and Mh-transducers

We consider the concepts of colored terms and multihypersubstitutions. If t ∈ Wτ (X) is a term of type τ , then any mapping αt : Pos F (t) → IN of the non-variable positions of a term into the set of natural numbers is called a coloration of t. The set W c τ (X) of colored terms consists of all pairs 〈t, αt〉. Hypersubstitutions are maps which assign to each operation symbol a term with the same...

متن کامل

Weighted Finite - State Transducers inSpeech

We survey the use of weighted nite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for HMM models, context-dependency, pronunciation dictionaries , grammars, and alternative recognition outputs. Furthermore, general transducer operations combine these representations exibly and ee-ciently. Weighted determinization and minimization ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: MRS Bulletin

سال: 1982

ISSN: 0883-7694,1938-1425

DOI: 10.1557/s0883769400049563